Best Uniform Convex Approximation on a Compact Convex Set
نویسندگان
چکیده
منابع مشابه
Best Approximation under a Convex Paranorm
We introduce the q-paranorm, investigate some of its properties. We further give an algorithm which constructs the best linear approximations under the q-paranorm.
متن کاملOn the Chvátal-Gomory Closure of a Compact Convex Set
In this paper, we show that the Chvátal-Gomory closure of any compact convex set is a rational polytope. This resolves an open question of Schrijver [17] for irrational polytopes1, and generalizes the same result for the case of rational polytopes [17], rational ellipsoids [8] and strictly convex bodies [7].
متن کاملFinding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
We study the convergence of an iterative projection/reflection algorithm originally proposed for solving what are known as phase retrieval problems in optics. There are two features that frustrate any analysis of iterative methods for solving the phase retrieval problem: nonconvexity and infeasibility. The algorithm that we developed, called Relaxed Averaged Alternating Reflections (RAAR), was ...
متن کاملInhomogeneous polynomial optimization over a convex set: An approximation approach
In this paper, we consider computational methods for optimizing a multivariate inhomogeneous polynomial function over a general convex set. The focus is on the design and analysis of polynomial-time approximation algorithms. The methods are able to deal with optimization models with polynomial objective functions in any fixed degrees. In particular, we first study the problem of maximizing an i...
متن کاملConvex Hull, Set of Convex Combinations and Convex Cone
Let V be a real linear space. The functor ConvexComb(V ) yielding a set is defined by: (Def. 1) For every set L holds L ∈ ConvexComb(V ) iff L is a convex combination of V . Let V be a real linear space and let M be a non empty subset of V . The functor ConvexComb(M) yielding a set is defined as follows: (Def. 2) For every set L holds L ∈ ConvexComb(M) iff L is a convex combination of M . We no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1994
ISSN: 0022-247X
DOI: 10.1006/jmaa.1994.1152